YAM2: Yet another library for the M2 variables using sequential quadratic programming
نویسندگان
چکیده
منابع مشابه
Figaro: Yet Another Constraint Programming Library
Existing libraries and languages for nite domain constraint programming usually have depth-rst search (with branch and bound) built-in as the only search algorithm. Exceptions are the languages claire and Oz, which support the programming of diierent search algorithms through special purpose programming language constructs. The goal of this work is to make abstractions for programming search al...
متن کاملYAM2 (Yet Another Multidimensional Model): An Extension of UML
This paper presents a multidimensional conceptual Object-Oriented model, its structures, integrity constraints and query operations. It has been developed as an extension of UML core metaclasses to facilitate its usage, as well as to avoid the introduction of completely new concepts. YAM2 allows the representation of several semantically related star schemas, as well as summarizability and iden...
متن کاملYalAA: Yet Another Library for Affine Arithmetic
In this paper, we present YalAA, a new library for affine arithmetic. Recently, affine arithmetic has been given increased attention even from outside the traditional verified computing community, for example, in the areas of circuit design, GPU based rendering of implicit objects and global optimization. Furthermore, several improvements to the original affine model were proposed. However, a f...
متن کاملThe Sequential Quadratic Programming Method
Sequential (or Successive) Quadratic Programming (SQP) is a technique for the solution of Nonlinear Programming (NLP) problems. It is, as we shall see, an idealized concept, permitting and indeed necessitating many variations and modifications before becoming available as part of a reliable and efficient production computer code. In this monograph we trace the evolution of the SQP method throug...
متن کاملStabilized Sequential Quadratic Programming
Recently, Wright proposed a stabilized sequential quadratic programming algorithm for inequality constrained optimization. Assuming the Mangasarian-Fromovitz constraint qualification and the existence of a strictly positive multiplier (but possibly dependent constraint gradients), he proved a local quadratic convergence result. In this paper, we establish quadratic convergence in cases where bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2021
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2021.107967